A Review of Population-Based Metaheuristics for Large-Scale Black-Box Global Optimization—Part II
نویسندگان
چکیده
This article is the second part of a two-part survey series on large-scale global optimization. The first covered two major algorithmic approaches to optimization, namely, decomposition methods and hybridization methods, such as memetic algorithms local search. In this part, we focus sampling variation operators, approximation surrogate modeling, initialization parallelization. We also cover range problem areas in relation multiobjective constraint handling, overlapping components, component imbalance issue benchmarks, applications. includes discussion pitfalls challenges current research identifies several potential future research.
منابع مشابه
Center-Based Initialization for Large-Scale Black-Box Problems
Nowadays, optimization problems with a few thousands of variables become more common. Populationbased algorithms, such as Differential Evolution (DE), Particle Swarm Optimization (PSO), Genetic Algorithms (GAs), and Evolutionary Strategies (ES) are commonly used approaches to solve complex large-scale problems from science and engineering. These approaches all work with a population of candidat...
متن کاملA Unified Search Framework for Large-scale Black-box Optimization
The parameter configuration of a network protocol can be formulated as a black-box optimization problem with network simulation evaluating the performance of the blackbox, i.e., the network. This paper proposes a unified search framework (USF) to handle such large-scale black-box optimization problems. The framework is designed to provides a general platform on which tailored optimization algor...
متن کاملMetaheuristics in large-scale global continues optimization: A survey
Metaheuristic algorithms are extensively recognized as effective approaches for solving high-dimensional optimization problems. These algorithms provide effective tools with important applications in business, engineering, economics, and science. This paper surveys state-of-the-art metaheuristic algorithms and their current applications in the field of large-scale global optimization. The paper...
متن کاملA partition-based algorithm for clustering large-scale software systems
Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...
متن کاملEmbedded Bandits for Large-Scale Black-Box Optimization
Random embedding has been applied with empirical success to large-scale black-box optimization problems with low effective dimensions. This paper proposes the EMBEDDEDHUNTER algorithm, which incorporates the technique in a hierarchical stochastic bandit setting, following the optimism in the face of uncertainty principle and breaking away from the multiple-run framework in which random embeddin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Evolutionary Computation
سال: 2022
ISSN: ['1941-0026', '1089-778X']
DOI: https://doi.org/10.1109/tevc.2021.3130835